#include <iostream>
#include "BiGraph.h"

using namespace std;


int main()
{
    BiGraph<int> bg;
    bg.add_edge(1,2);
    bg.add_edge(1,3); 
    bg.add_edge(1,4);
    bg.add_edge(3,2);
    bg.add_edge(3,3);
    bg.add_vertex(18);
    if (bg.delete_edge(1,2)) cout << "Good edge!" << endl;
    if(!bg.delete_edge(1,10)) cout << "Bad edge!" << endl;
    cout << bg.vertices_count() << endl;
    for (BiGraph<int>::vertex_iterator it = bg.begin(); it != bg.end(); ++it)
    {
        cout << it->getName() << endl;
        for (BiGraph<int>::edge_iterator_out eit = it->begin_out(); eit != it->end_out(); ++ eit)
            cout << eit->get_begin_vertex() << " - " << eit->get_end_vertex() << endl;
    }
    return 0;
}